De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences
نویسندگان
چکیده
This paper presents a method to find new de Bruijn cycles based on ones of lesser order. This is done by mapping a de Bruijn cycle to several vertex disjoint cycles in a de Bruijn digraph of higher order and connecting these cycles into one full cycle. We characterize homomorphisms between de Bruijn digraphs of different orders that allow this construction. These maps generalize the well-known D-morphism of Lempel between de Bruijn digraphs of consecutive orders. Also, an efficient recursive algorithm that yields an exponential number of nonbinary de Bruijn cycles is implemented.
منابع مشابه
Correlation of Pseudorandom Binary Sequences from de Bruijn Graphs
Binary sequences with good correlation properties play an important role in many secure communication systems and testing of systems. In this paper, we describe and illustrate sets of pseudorandom sequences from de Bruijn graphs which have good correlation functions and critically analyze how we investigate all homomorphisms that give low correlation values between the binary sequences. We comp...
متن کاملGenerating De Bruijn Sequences: An Efficient Implementation
This paper presents a concise and efficient implementation of a method of producing De Bruijn sequences. The implementation is based on a recursive method due to Lempel [5]. We provide code for a function that for each pair of integers n ≥ 2 and 0 £ x < 2 returns a unique De Bruijn sequence of order-n. The implementation requires only O(2 n ) bit operations
متن کاملCryptographic D-morphic Analysis and Fast Implementations of Composited De Bruijn Sequences
Recently, Mandal and Gong [23] refined and analyzed the recursive method by Lempel and Mykkeltveit et al. for generating de Bruijn sequences, where the recursive feedback function is the sum of a feedback function with k-th order composition and a sum of (k + 1) product-of-sum terms. In this paper we first determine the linear complexity of a composited de Bruijn sequence. We then conduct a pro...
متن کاملOn the Distribution of de Bruijn Sequences of Low Complexity
The distribution y(c, n) of de Bruijn sequences of order n and linear complexity c is investigated. Some new results are proved on the distribution of de Bruijn sequences of low complexity, i.e., their complexity is between 2”-’ + n and 2”-‘+2”-2. It is proved that for n>5 and 2”-‘+n 0. It is also proved that ~(2”~’ +2...
متن کاملClustering of Short Read Sequences for de novo Transcriptome Assembly
Given the importance of transcriptome analysis in various biological studies and considering thevast amount of whole transcriptome sequencing data, it seems necessary to develop analgorithm to assemble transcriptome data. In this study we propose an algorithm fortranscriptome assembly in the absence of a reference genome. First, the contiguous sequencesare generated using de Bruijn graph with d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0812.4012 شماره
صفحات -
تاریخ انتشار 2008